Formal Language Decomposition into Semantic Primes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Are There Semantic Primes in Formal Languages?

This paper surveys languages used to enrich contextual information with semantic descriptions. Such descriptions can be e.g. applied to enable reasoning when collecting vast amounts of row data in domains like smart environments. In particular, we focus on the elements of the languages that make up their semantic. To do so, we compare the expressiveness of the well-known languages OWL, PDDL and...

متن کامل

ON THE DECOMPOSITION OF n! INTO PRIMES

In this note, we approximate the average of prime powers in the decomposition of n! into prime numbers.

متن کامل

A Formal Semantic Framework for Sadl Language

The primary purpose of an ADL (Architecture Description Language) is to specify the structural composition of a software system in terms of system's components and connectors through the means of a formal representational language. Many ADLs have emerged recently, none of them addresses formal analysis and verification of distributed architecture with a tractable model and an efficient mechanis...

متن کامل

Associated Primes and Primary Decomposition

These notes are an attempt to unify the presentations of associated primes and primary decomposition given by Atiyah-Macdonald [1], Bourbaki [2], and Matsumura [3]. Their definitions differ somewhat, and we hope that the ways in which we have chosen to highlight these differences will lead to the reader having a greater understanding of the important concepts described herein. The differing def...

متن کامل

Primary Decomposition and Associated Primes

If N is a submodule of the R-module M , and a ∈ R, let λa : M/N → M/N be multiplication by a. We say that N is a primary submodule of M if N is proper and for every a, λa is either injective or nilpotent. Injectivity means that for all x ∈ M , we have ax ∈ N ⇒ x ∈ N . Nilpotence means that for some positive integer n, aM ⊆ N , that is, a belongs to the annihilator of M/N , denoted by ann(M/N). ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal

سال: 2014

ISSN: 2255-2863

DOI: 10.14201/adcaij2014385673